Path Planning for Mobile Robot with Half-sweep Successive Over- Relaxation (hssor) Iterative Method
نویسندگان
چکیده
This paper describes our work in solving path planning problem for mobile robot by using harmonic functions to generate path in the configuration space. Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. This work attempts to speed up the computation by solving the harmonic functions with faster solver using Half-Sweep Successive Over-Relaxation (HSSOR) iterative method. The efficiency of this approach is shown by comparing its performance with the previous method.
منابع مشابه
Path Planning for Indoor Mobile Robot using Half-Sweep SOR via Nine-Point Laplacian (HSSOR9L)
This paper proposed fast Half-Sweep SOR via Nine-Point Laplacian (HSSOR9L) iterative method for solving path planning problem for a mobile robot operating in indoor environment model. It is based on the use of Laplace’s Equation to constraint the distribution of potential values in the environment of the robot. Fast computation with half-sweep iteration is obtained by considering only half of w...
متن کاملRobot Path Planning with EGSOR Iterative Method using Laplacian Behaviour-Based Control (LBBC)
This paper proposed a robust searching algorithm to generate path planning for mobile robot. The searching algorithm employs Laplacian Behaviour-Based Control (LBBC) during space exploration of the environment. The LBBC make use of the potential function in the configuration space to guide its exploration. Laplace’s equation was used to represent the potential function in the configuration spac...
متن کاملGauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations
In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.
متن کاملFormation Control and Path Planning of Two Robots for Tracking a Moving Target
This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...
متن کاملPath Relaxation: Path Planning for a Mobile Robot
Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid starch that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Path Relaxation allows an explicit tradeoff among length of path, clearance away from obstacles, and distance t...
متن کامل